A note on disjoint arborescences
نویسنده
چکیده
Recently Kamiyama, Katoh, and Takizawa have shown a theorem on packing arc-disjoint arborescences that is a proper extension of Edmonds’ theorem on disjoint spanning branchings. We show a further extension of their theorem, which makes clear an essential rôle of a reachability condition played in the theorem. The right concept required for the further extension is “convexity” instead of “reachability.”
منابع مشابه
Disjoint paths in arborescences
An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds characterizes which digraphs have λ arc-disjoint arborescences rooted at r. A similar theorem of Menger guarantees λ strongly arc disjoint rv-paths for every vertex v, where “strongly” means no two paths contain a pair of symmetric arcs. We prove that if a directed graph D contains two arc-disjoin...
متن کاملPacking Arborescences in Acyclic Temporal Networks
A temporal network is a finite directed graph in which each arc has a time label specifying the time at which its end-vertices communicate. An arborescence in a temporal network is said to be timerespecting, if the time labels on every directed path from the root in this arborescence are monotonically non-decreasing. In this paper, we consider the problem of packing time-respecting arborescence...
متن کاملCovering Intersecting Bi-set Families under Matroid Constraints
Edmonds’ fundamental theorem on arborescences [4] characterizes the existence of k pairwise edge-disjoint arborescences with the same root in a directed graph. In [9], Lovász gave an elegant alternative proof which became the base of many extensions of Edmonds’ result. In this paper, we use a modification of Lovász’ method to prove a theorem on covering intersecting bi-set families under matroi...
متن کاملOn packing spanning arborescences with matroid constraint
Let D = (V + s,A) be a digraph with a designated root vertex s. Edmonds’ seminal result [4] implies that D has a packing of k spanning s-arborescences if and only if D has a packing of k (s, t)-paths for all t ∈ V , where a packing means arc-disjoint subgraphs. Let M be a matroid on the set of arcs leaving s. A packing of (s, t)-paths is called M-based if their arcs leaving s form a base of M w...
متن کاملA linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
a r t i c l e i n f o a b s t r a c t Suppose that we are given a directed graph D = (V , A) with specified vertices r 1 , r 2 ∈ V. In this paper, we consider the problem of discerning the existence of a pair of arc-disjoint spanning in-arborescence rooted at r 1 and out-arborescence rooted at r 2 , and finding such arborescences if they exist. It is known (Bang-Jensen (1991) [1]) that this pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 30 شماره
صفحات -
تاریخ انتشار 2010